PGP%2Dmc Towards a Multicore Parallel Approach for Mining Gradual Patterns.

PGP%2Dmc  extraction parall%E8le efficace de motifs graduels.

D%E9couverte d%27itemsets fr%E9quents ferm%E9s sur architecture multicoeurs.

Discovering closed frequent itemsets on multicore Parallelizing computations and optimizing memory accesses.

Discovering closed frequent itemsets on multicore Parallelizing computations and optimizing memory accesses.

Combining Logic and Probabilities for Discovering Mappings between Taxonomies.

DryadeParent%2C An Efficient and Robust Closed Attribute Tree Mining Algorithm.

DIGDAG%2C a First Algorithm to Mine Closed Frequent Embedded Sub%2DDAGs.

Efficient Mining of High Branching Factor Attribute Trees.

DRYADE A New Approach for Discovering Closed Frequent Trees in Heterogeneous Tree Databases.
Abstract In this paper we present a novel algorithm for discover-ing tree patterns in a tree database. This algorithm uses a relaxed tree inclusion definition, making the problem morecomplex (checking tree inclusion is NP-complete), but allowing to mine highly heterogeneous databases. To obtaingood performances, our D RYADE algorithm discovers onlyclosed frequent tree patterns.
TreeFinder a First Step towards XML Data Mining.

Raising the Dead Extending Evolutionary Algorithms with a Case%2DBased Memory.
In dynamically changing environments, the performance of a standard evolutionary algorithm deteriorates. This is due to the fact that the population, which is considered to contain the history of the evolutionary process, does not contain enough information to allow the algorithm to react adequately to changes in the fitness landscape. Therefore, we added a simple, global case-based memory to the process to keep track of interesting historical events. Through the introduction of this memory and a storing and replacement scheme we were able to improve the reaction capabilities of an evolutionary algorithm with a periodically changing fitness function.
Combining Statistics and Semantics for Word and Document Clustering.
A new approach for constructing pseudo-keywords,  referred to as Sense Units, is proposed. Sense  Units are obtained by a word clustering process,  where the underlying similarity reflects both statistical  and semantic properties, respectively detected  through Latent Semantic Analysis and WordNet.
